Étale Lattices over Quadratic Integers
نویسنده
چکیده
We construct lattices with quadratic structure over the integers in quadratic number fields having the property that the rank of the quadratic structure is constant and equal to the rank of the lattice in all reductions modulo maximal ideals. We characterize the case in which such lattices are free. The construction gives a representative of the genus of such lattices as an orthogonal sum of “standard” pieces of ranks 1 – 4 and covers the case of the discriminant of the real quadratic number field congruent to 1 modulo 8 for which a general construction was not known.
منابع مشابه
Even Universal Binary Hermitian Lattices over Imaginary Quadratic Fields
A positive definite even Hermitian lattice is called even universal if it represents all even positive integers. We introduce a method to get all even universal binary Hermitian lattices over imaginary quadratic fields Q( √ −m) for all positive square-free integers m and we list optimal criterions on even universality of Hermitian lattices over Q( √ −m) which admits even universal binary Hermit...
متن کاملBinary Normal Regular Hermitian Lattices over Imaginary Quadratic Fields
We call a positive definite Hermitian lattice regular if it represents all integers, which can be represented locally by the lattice. We investigate binary regular Hermitian lattices over imaginary quadratic fields Q( √ −m) and provide a complete list of the (normal) binary regular Hermitian lattices.
متن کاملSimple Proofs for Universal Binary Hermitian Lattices
It has been a central problem in the theory of quadratic forms to find integers represented by quadratic forms. The celebrated Four Square Theorem by Lagrange [10] was an outstanding result in this study. Ramanujan generalized this theorem and found 54 positive definite quaternary quadratic forms which represent all positive integers [13]. We call a positive definite quadratic form universal, i...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملEven Universal Binary Hermitian Lattices and an Application to the Kloosterman Problem over Imaginary Quadratic Fields
We call a positive definite even Hermitian lattice even universal if it represents all even positive integers. We introduce a method to get all even universal binary Hermitian lattices over imaginary quadratic fields Q( √ −m) for all m and we list optimal criterions on even universality of Hermitian lattices over Q( √ −m) which admits even universal binary Hermitian lattices. And we apply our r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005